An Authenticated Group Key Agreement Protocol on Braid groups

نویسندگان

  • Ho-Kyu Lee
  • Hyang-Sook Lee
  • Young-Ran Lee
چکیده

In this paper, we extend the 2-party key exchange protocol on braid groups to the group key agreement protocol based on the hardness of Ko-Lee problem. We also provide authenticity to the group key agreement protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups

In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjugacy Search Problem (CSP) is hard in braid group.

متن کامل

Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups

Braid groups were first introduced by Emil Artin in 1925. First cryptosystem, using Braid groups as a platform was discovered by Anshel et al in 2001. After the publication of this paper several cryptosystems on Braid groups had been designed. In this paper we have proposed a tripartite authenticated key agreement protocol using conjugacy problem which works in a braid group. We have proved tha...

متن کامل

Provably Authenticated Group Key Agreement Based on Braid Groups - The Dynamic Case

Most group key agreement protocols make use of modular exponential operations which require extensive computing resources in devices. Thus, they are unsuitable for resourceconstrained devices such as mobile phones, smart cards and intelligent watches. This paper proposes a group key agreement protocol based on braid groups which requires only multiplication operations. The proposed protocol is ...

متن کامل

Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups

The braid group with its conjugacy problem is one of the recent hot issues in cryptography. At CT-RSA 2001, Anshel, Anshel, Fisher, and Goldfeld proposed a commutator key agreement protocol (KAP) based on the braid groups and their colored Burau representation. Its security is based on the multiple simultaneous conjugacy problem (MSCP) plus a newly adopted key extractor. This article shows how ...

متن کامل

Efficient Group Key Agreement on Tree-based Braid Groups

The security issues in ad hoc network are increasingly important. In this paper, we propose a distributed key management what approach by using braid groups and key tree. Without any assumption of prefixed trust relationship between nodes, the proposed method works in a self-organizing way to provide the key management services. The using of the proposed tree-based braid groups has following ad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2003  شماره 

صفحات  -

تاریخ انتشار 2003